Repeated signaling games

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repeated signaling games

A class of repeated signaling games is analyzed. It is shown that costly signaling is possible even in periods after types are revealed. A reasonable belief system that supports least cost separating equilibria (LCSE) is introduced. Possible time patterns of signaling in a LCSE are characterized.

متن کامل

Repeated Games with Partial Monitoring: the Stochastic Signaling Case

In this work we extend a result of Lehrer characterizing the correlated equilibrium payoffs in undiscounted two player repeated games with partial monitoring to the case in which the signals are permitted to be stochastic. In particular we develop appropriate versions of Lehrer’s concepts of “indistinguishable” and “more informative.” We also show that any payoff associated with a (correlated) ...

متن کامل

Repeated Games

I Basic Results on Normal Form Games 3 I.1 The Minmax Theorem 4 I.1.a Definitions and Notations 4 I.1.b A Basic Theorem 5 I.1.c Convexity 6 I.1.d Mixed Strategies 6 I.1.e Note on the Separation Theorem 9 Exercises 10 I.2 Complements to the Minmax Theorem 15 I.2.a The Topology on S 16 I.2.b Lack of Continuity: Regularization 16 I.2.c Lack of Compactness: Approximation 19 I.2.d Measurability: Sym...

متن کامل

Repeated games

This entry shows why self-interested agents manage to cooperate in a long-term relationship. When agents interact only once, they often have an incentive to deviate from cooperation. In a repeated interaction, however, any mutually beneficial outcome can be sustained in an equilibrium. This fact, known as the folk theorem, is explained under various information structures. This entry also compa...

متن کامل

Repeated Games

for every path a. The corresponding one-shot or stage game is denoted by G = ( {Ai}i=1, { fi}i=1 ) . The usual interpretation is that Ai is a set of pure actions.1 The set of feasible payoff vectors of the stage game G is given by the set F ≡ {p ∈ Rn| f (a) = p for some a ∈ A}. Let F∗ be the convex hull of the set of feasible payoffs. It should be clear that any normalized payoff in the repeate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games and Economic Behavior

سال: 2009

ISSN: 0899-8256

DOI: 10.1016/j.geb.2008.09.030